Англо-русский словарь промышленной и научной лексики. 2014.
Max-min fairness — In communication networks and multiplexing, a division of the bandwidth resources is said to be max min fair when: firstly, the minimum data rate that a dataflow achieves is maximized; secondly, the second lowest data rate that a dataflow… … Wikipedia
Blue (queue management algorithm) — Blue [W. Feng, D. Kandlur, D. Saha, K. Shin. Blue: A New Class of Active Queue Management Algorithms. U. Michigan CSE TR 387 99, April 1999.] is an Active Queue Management algorithm. Like RED, it operates by randomly dropping or ECN marking… … Wikipedia
NetEqualizer — The NetEqualizer is a bandwidth shaping system designed for voice and data networks created by APconnections in 2003. NetEqualizer appliances use built in fairness rules to automatically shape traffic. [1] Based on current network usage, traffic… … Wikipedia
Online DVD rental — Online DVD rentals allow a person to rent DVDs by mail. Generally, all interaction between the renter and the rental company takes place through the company s website.How it worksMost companies operate on the following model: *The customer joins… … Wikipedia
DVD-by-mail — Part of a series on Electronic commerce Online goods and services Streaming media Electronic books Softwar … Wikipedia
Taxonomy of congestion control — refers to grouping congestion control algorithms according to their characteristics.Example classificationThe following is one possible classification according to the following properties: #The type and amount of feedback received from the… … Wikipedia
Unbounded nondeterminism — In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitration of contention for shared resources while… … Wikipedia
Network congestion — In data networking and queueing theory, network congestion occurs when a link or node is carrying so much data that its quality of service deteriorates. Typical effects include queueing delay, packet loss or the blocking of new connections. A… … Wikipedia
Scheduling (computing) — This article is about processes assignment in operating systems. For other uses, see Scheduling (disambiguation). Scheduling is a key concept in computer multitasking, multiprocessing operating system and real time operating system designs.… … Wikipedia
Fair queuing — is a scheduling algorithm used in computer and telecommunications networks to allow multiple packet flows to fairly share the link capacity. The advantage over conventional first in first out (FIFO) queuing is that a high data rate flow,… … Wikipedia
Round-robin scheduling — Round robin (RR) is one of the simplest scheduling algorithms for processes in an operating system, which assigns time slices to each process in equal portions and in order, handling all processes without priority. Round robin scheduling is both… … Wikipedia
